Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies

نویسندگان

  • Santiago Figueira
  • Daniel Gorín
  • Rafael Grimson
چکیده

It is well-known that Independence Friendly (IF) logic is equivalent to existential second-order logic (Σ1) and, therefore, is not closed under classical negation. The Boolean closure of IF sentences, called Extended IF-logic, on the other hand, corresponds to a proper fragment of ∆2. In this article we consider SL(↓), IF-logic extended with Hodges’ flattening operator ↓, which allows to define a classical negation. Furthermore, this negation, in Hodges’ style, may occur also under the scope of IF quantifiers. SL(↓) contains Extended IF-logic and hence it is at least as expressive as the Boolean closure of Σ1. We prove that SL(↓) corresponds to a weak syntactic fragment of SO which we show to be strictly contained in ∆2. The separation is derived almost trivially from the fact that Σn defines its own truth-predicate. We finally show that SL(↓) is equivalent to the logic of Henkin quantifiers, which shows, we argue, that Hodges’ notion of negation is adequate.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Expressive Power of IF-Logic with Classical Negation

It is well-known that Independence Friendly (IF) logic is equivalent to existential second-order logic (Σ 1) and, therefore, is not closed under classical negation. The boolean closure of IF sentences, called Extended IF-logic, on the other hand, corresponds to a proper fragment of ∆2. In this paper we consider IF-logic extended with Hodges’ flattening operator, which allows classical negation ...

متن کامل

Team building in dependence

Hintikka and Sandu’s Independence-Friendly Logic was introduced as a logic for partially ordered quantification, in which the independence of (existential) quantifiers from previous (universal) quantifiers is written by explicit syntax. It was originally given a semantics by games of imperfect information; Hodges then gave a (necessarily) second-order Tarskian semantics. More recently, Väänänen...

متن کامل

Team Logic

Team logic is the logic of functional dependencies. We define the basic logical operations of team logic, establish its relationship with independence friendly and second order logic, and give it a game theoretic characterization.

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Logics of Imperfect Information without Identity

We investigate the expressive power of sentences of the family of independence-friendly (IF) logics in the equality-free setting. Various natural equality-free fragments of logics in this family translate into the version of existential second-order logic with prenex quantification of function symbols only and with the first-order parts of formulae equality-free. We study this version of existe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 80  شماره 

صفحات  -

تاریخ انتشار 2014